package leetcode.剑指offer.后40;

import leetcode.剑指offer.pojo.TreeNode;
import org.junit.Test;

import java.util.List;

/**
 * @author :songyaozhang
 * @date :Created 2021/8/12 10:42
 * @description :
 */
public class 剑指_68_II_二叉树的最近公共祖先 {
    @Test
    public void test() {
        Solution solution = new Solution();

    }

    class Solution {
        public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
            List<Integer> path_p = getPath(root, p);
            return null;
        }

        private List<Integer> getPath(TreeNode root, TreeNode node) {
            return null;
        }
    }
}
